On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems
نویسنده
چکیده
We investigate stability of scheduling policies in queueing systems. To this day no algorithmic characterization exists for checking stability of a given policy in a given queueing system. In this paper we introduce a certain generalized priority policy and prove that the stability of this policy is algorithmically undecidable. We also prove that stability of a homogeneous random walk in d+ is undecidable. Finally, we show that the problem of computing a fluid limit of a queueing system or of a constrained homogeneous random walk is undecidable. To the best of our knowledge these are the first undecidability results in the area of stability of queueing systems and random walks in d+. We conjecture that stability of common policies like First-In-First-Out and priority policy is also an undecidable problem.
منابع مشابه
Algorithmic challenges in the theory of queueing networks
The theory of queueing systems is traditionally considered as a branch of applied probability. Hence the toolkit used in the analysis of queueing system draws heavily on the theory of stochastic processes. Many problems in the area of queueing networks, however, are of algorithmic nature, and thus require algorithmic/complexity theoretic approaches. In this tutorial we will discuss several such...
متن کاملstationary probability distributions and large deviation rates for constrained random walks . The undecidability results
Our model is a constrained homogeneous random walk in Z +. The convergence to stationarity for such a random walk can often be checked by constructing a Lyapunov function. The same Lyapunov function can also be used for computing approximately the stationary distribution of this random walk, using methods developed by Meyn and Tweedie in [34]. In this paper we show that, for this type of random...
متن کاملInvariant measures and error bounds for random walks in the quarter-plane based on sums of geometric terms
We consider homogeneous random walks in the quarter-plane. The necessary conditions which characterize random walks of which the invariant measure is a sum of geometric terms are provided in Chen et al. (arXiv:1304.3316, 2013, Probab Eng Informational Sci 29(02):233–251, 2015). Based on these results, we first develop an algorithm to check whether the invariant measure of a given random walk is...
متن کاملOn Random Walks Arising in Queueing Systems: Ergodicity and Transience via Quadratic Forms as Lyapounov Functions - Part I
To cite this version: Guy Fayolle. On random walks arising in queueing systems : ergodicity and transience via quadratic forms as Lyapounov functions-part I-. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or f...
متن کاملApplied Probability Trust (26 August 2015) SERIES EXPANSIONS FOR THE ALL-TIME MAXIMUM OF α- STABLE RANDOM WALKS
We study random walks whose increments are α-stable distributions with shape parameter 1 < α < 2. Specifically, assuming a mean increment size which is negative, we provide series expansions in terms of the mean increment size for the probability that the all-time maximum of an α-stable random walk is equal to zero and, in the totally skewed to the left case of skewness parameter β = −1, for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 27 شماره
صفحات -
تاریخ انتشار 2002